Covering numbers, Vapnik-ervonenkis classes and bounds for the star-discrepancy
نویسنده
چکیده
We show new lower bounds for the star-discrepancy and its inverse for subsets of the unit cube. They are polynomial in the quotient d/n of the number n of sample points and the dimension d. They provide the best known lower bounds for n not too large compared with d.
منابع مشابه
Entropy Numbers of Linear Function Classes
This paper collects together a miscellany of results originally motivated by the analysis of the generalization performance of the “maximum-margin” algorithm due to Vapnik and others. The key feature of the paper is its operator-theoretic viewpoint. New bounds on covering numbers for classes related to Maximum Margin classes are derived directly without making use of a combinatorial dimension s...
متن کاملDeciding the Vapnik-Cervonenkis dimension is ...-complete
Linial et al. raised the question of how diicult the computation of the Vapnik-ervonenkis dimension of a concept class over a nite universe is. Papadmimitriou and Yannakakis obtained a rst answer using matrix representations of concept classes. We choose a more natural representation , which leads us to redeene the vc dimension problem. We establish that vc dimension is p 3-complete, thereby gi...
متن کاملBracketing numbers for axis-parallel boxes and applications to geometric discrepancy
In the first part of this paper we derive lower bounds and constructive upper bounds for the bracketing numbers of anchored and unanchored axis-parallel boxes in the d-dimensional unit cube. In the second part we apply these results to geometric discrepancy. We derive upper bounds for the inverse of the star and the extreme discrepancy with explicitly given small constants and an optimal depend...
متن کاملNonparametric regression estimation using penalized least squares
We present multivariate penalized least squares regression estimates. We use Vapnik{ Chervonenkis theory and bounds on the covering numbers to analyze convergence of the estimates. We show strong consistency of the truncated versions of the estimates without any conditions on the underlying distribution.
متن کاملمساله پوشش هاب تک تخصیصی بر روی شبکه ستاره‌ای؛ مدل‌بندی، خطی‌سازی و یافتن کران مناسب برای آن
The present study evaluates two problems of single allocation hub-covering problem with star structure including two problems of maximal p-hub covering and hub covering by considering the flow transfer costs. The star structure is as there is a central hub with definite location and other hubs are connected directly to the central hub. In the first problem, the goal is selection of p-hub locati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Complexity
دوره 20 شماره
صفحات -
تاریخ انتشار 2004